package leetcode.weekly.week346;

import leetcode.helper.H;

public class Solution4Test extends H {

	public void debug4(Solution4 so) {
		H.compare(so, so.modifiedGraphEdges(5, H.str2array1("[[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]]"), 0, 1, 5));
//		H.compare(so, so.modifiedGraphEdges(4, H.str2array1("[[1,0,4],[1,2,3],[2,3,5],[0,3,-1]]"), 0, 2, 6));
	}

	public void debug3(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution4 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution4Test test = new Solution4Test();
		Solution4 so = new Solution4();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}
	
//	5
//	[[4,1,-1],[2,0,-1],[0,3,-1],[4,3,-1]]
//	0
//	1
//	5
//	4
//	[[1,0,4],[1,2,3],[2,3,5],[0,3,-1]]
//	0
//	2
//	6
//	3
//	[[0,1,-1],[0,2,5]]
//	0
//	2
//	6
//	4
//	[[0,1,-1],[1,2,-1],[3,1,-1],[3,0,2],[0,2,5]]
//	2
//	3
//	8
	//???
//	5
//	[[3,0,1],[2,1,-1],[2,3,6],[4,2,6],[1,3,2],[2,0,7],[0,4,10],[0,1,6]]
//	1
//	4
//	14

}
